Penalty-Costs Constrained Bin Packing Problem
نویسندگان
چکیده
منابع مشابه
On a Constrained Bin-packing Problem
We study a bin-packing problem which is one-dimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical realtime scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system. The problem is stated in the traditional light: to use as few bins as possible to pack a given list of items, and it is a generaliza...
متن کاملBin-Packing Problem with Concave Costs of Bin Utilization
We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied...
متن کاملClass constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the...
متن کاملThe Lazy Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used or minimize the number of accepted items or the accepted volume. For the off-line variant, we require that t...
متن کاملThe Generalized Bin Packing Problem
We introduce the Generalized Bin Packing Problem, a new packing problem where, given a set of items characterized by volume and profit and a set of bins with given volumes and costs, one aims to select the subsets of profitable items and appropriate bins to optimize an objective function combining the cost of using the bins and the profit yielded by loading the selected items. The Generalized B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.12.418